Experimental study of scheduling with memory constraints using hybrid methods

Using Theory of Constraints in Production Management and Scheduling (A Case Study)

In manufacturing institutes the only access way to maximum profit is identifying the production mix of the products based on the limitations such as policies and politics, demand and production processes. This study identifies the constraints of a tile-manufacturing company including constraints in its production and demand line using LINGO software version 15, and identifying production bottle...

Parallel scheduling of DAGs under memory constraints

Scientific workflows are frequently modeled as Directed Acyclic Graphs (DAG) of tasks, which represent computational modules and their dependencies in the form of data produced by a task and used by another one. This formulation allows the use of runtime systems which dynamically allocate tasks onto the resources of increasingly complex computing platforms. However, for some workflows, such a d...

The Hybrid Flow Shop Scheduling with Special Time Constraints

A constraint satisfaction optimization model is established for just-in-time HFS scheduling problem with limited waiting time. Considering the problem’s complicated characteristic of having binary variables, this paper decomposes it into a Multiple Capacitated Flow Shop Scheduling (MCFS) problem and a machine allocation problem. During the process of solving the MCFS problem, a local search is ...

Managing Complex Scheduling Problems with Dynamic and Hybrid Constraints

Task Assignment and Scheduling under Memory Constraints

Many DSP and image processing embedded systems have hard memory constraints which makes it difficult to find a good task assignment and scheduling which fulfill these constraints. This paper presents a new heuristic developed for task assignment and scheduling for such systems. These systems have also a large number of constraints of different nature, such as cost, execution time, memory capaci...